0.11/0.15	% Problem    : Vampire---4.8_31314 : TPTP v0.0.0. Released v0.0.0.
0.11/0.16	% Command    : run_E %s %d THM
0.17/0.36	% Computer : n023.cluster.edu
0.17/0.36	% Model    : x86_64 x86_64
0.17/0.36	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.17/0.36	% Memory   : 8042.1875MB
0.17/0.36	% OS       : Linux 3.10.0-693.el7.x86_64
0.17/0.36	% CPULimit   : 1440
0.17/0.36	% WCLimit    : 180
0.17/0.37	% DateTime   : Mon Jul  3 13:12:51 EDT 2023
0.17/0.37	% CPUTime    : 
0.23/0.53	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.uNGUSLFT07/Vampire---4.8_31314
0.23/0.53	# Version: 3.1pre001-ho
0.47/0.68	# Preprocessing class: HSLSSMSMSSMCHSA.
0.47/0.68	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.47/0.68	# Starting post_as_ho6 with 900s (5) cores
0.47/0.68	# Starting post_as_ho8 with 180s (1) cores
0.47/0.68	# Starting new_bool_3 with 180s (1) cores
0.47/0.68	# Starting new_bool_1 with 180s (1) cores
0.47/0.68	# post_as_ho6 with pid 31493 completed with status 0
0.47/0.68	# Result found by post_as_ho6
0.47/0.68	# Preprocessing class: HSLSSMSMSSMCHSA.
0.47/0.68	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.47/0.68	# Starting post_as_ho6 with 900s (5) cores
0.47/0.68	# SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
0.47/0.68	# Search class: HGHSM-FSLM32-SHSFFSBC
0.47/0.68	# partial match(1): HGHSM-FSLM32-MHSFFSBC
0.47/0.68	# Scheduled 6 strats onto 5 cores with 900 seconds (900 total)
0.47/0.68	# Starting ehoh_best4 with 437s (1) cores
0.47/0.68	# Starting post_as_ho6 with 91s (1) cores
0.47/0.68	# Starting sh1 with 82s (1) cores
0.47/0.68	# Starting almost_fo_4 with 82s (1) cores
0.47/0.68	# Starting new_bool_8 with 82s (1) cores
0.47/0.68	# post_as_ho6 with pid 31498 completed with status 0
0.47/0.68	# Result found by post_as_ho6
0.47/0.68	# Preprocessing class: HSLSSMSMSSMCHSA.
0.47/0.68	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.47/0.68	# Starting post_as_ho6 with 900s (5) cores
0.47/0.68	# SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true)
0.47/0.68	# Search class: HGHSM-FSLM32-SHSFFSBC
0.47/0.68	# partial match(1): HGHSM-FSLM32-MHSFFSBC
0.47/0.68	# Scheduled 6 strats onto 5 cores with 900 seconds (900 total)
0.47/0.68	# Starting ehoh_best4 with 437s (1) cores
0.47/0.68	# Starting post_as_ho6 with 91s (1) cores
0.47/0.68	# Preprocessing time       : 0.006 s
0.47/0.68	# Presaturation interreduction done
0.47/0.68	
0.47/0.68	# Proof found!
0.47/0.68	# SZS status Theorem
0.47/0.68	# SZS output start CNFRefutation
0.47/0.68	thf(decl_33, type, min_dist_capacity: (product_prod_nat_nat > capacity) > nat > nat > nat).
0.47/0.68	thf(decl_36, type, plus_plus_nat: nat > nat > nat).
0.47/0.68	thf(decl_37, type, size_s1990949619at_nat: list_P559422087at_nat > nat).
0.47/0.68	thf(decl_39, type, ord_less_nat: nat > nat > $o).
0.47/0.68	thf(decl_40, type, ord_less_eq_nat: nat > nat > $o).
0.47/0.68	thf(decl_43, type, c: product_prod_nat_nat > capacity).
0.47/0.68	thf(decl_47, type, p1a: list_P559422087at_nat).
0.47/0.68	thf(decl_49, type, p2_a: list_P559422087at_nat).
0.47/0.68	thf(decl_51, type, s: nat).
0.47/0.68	thf(decl_52, type, t: nat).
0.47/0.68	thf(decl_54, type, ua: nat).
0.47/0.68	thf(fact_75_add_Ocommute, axiom, ((plus_plus_nat)=(^[X48:nat, X49:nat]:(plus_plus_nat @ X49 @ X48))), file('/export/starexec/sandbox/tmp/tmp.uNGUSLFT07/Vampire---4.8_31314', fact_75_add_Ocommute)).
0.47/0.68	thf(fact_102_add__mono__thms__linordered__field_I5_J, axiom, ![X25:nat, X26:nat, X20:nat, X27:nat]:(((ord_less_nat @ (plus_plus_nat @ X25 @ X20) @ (plus_plus_nat @ X26 @ X27))<=((ord_less_nat @ X20 @ X27)&(ord_less_nat @ X25 @ X26)))), file('/export/starexec/sandbox/tmp/tmp.uNGUSLFT07/Vampire---4.8_31314', fact_102_add__mono__thms__linordered__field_I5_J)).
0.47/0.68	thf(conj_0, conjecture, (ord_less_nat @ (min_dist_capacity @ c @ s @ t) @ (plus_plus_nat @ (size_s1990949619at_nat @ p1a) @ (size_s1990949619at_nat @ p2_a))), file('/export/starexec/sandbox/tmp/tmp.uNGUSLFT07/Vampire---4.8_31314', conj_0)).
0.47/0.68	thf(fact_0__092_060open_062min__dist_As_At_A_061_Amin__dist_As_Au_A_L_Amin__dist_Au_At_092_060close_062, axiom, ((min_dist_capacity @ c @ s @ t)=(plus_plus_nat @ (min_dist_capacity @ c @ s @ ua) @ (min_dist_capacity @ c @ ua @ t))), file('/export/starexec/sandbox/tmp/tmp.uNGUSLFT07/Vampire---4.8_31314', fact_0__092_060open_062min__dist_As_At_A_061_Amin__dist_As_Au_A_L_Amin__dist_Au_At_092_060close_062)).
0.47/0.68	thf(fact_270_dual__order_Ostrict__iff__order, axiom, ((ord_less_nat)=(^[X49:nat, X48:nat]:((((X48)!=(X49))&(ord_less_eq_nat @ X49 @ X48))))), file('/export/starexec/sandbox/tmp/tmp.uNGUSLFT07/Vampire---4.8_31314', fact_270_dual__order_Ostrict__iff__order)).
0.47/0.68	thf(fact_1__092_060open_062min__dist_As_Au_A_060_Alength_Ap1_092_060close_062, axiom, (ord_less_nat @ (min_dist_capacity @ c @ s @ ua) @ (size_s1990949619at_nat @ p1a)), file('/export/starexec/sandbox/tmp/tmp.uNGUSLFT07/Vampire---4.8_31314', fact_1__092_060open_062min__dist_As_Au_A_060_Alength_Ap1_092_060close_062)).
0.47/0.68	thf(fact_98_add__strict__left__mono, axiom, ![X1:nat, X3:nat, X4:nat]:(((ord_less_nat @ (plus_plus_nat @ X4 @ X1) @ (plus_plus_nat @ X4 @ X3))<=(ord_less_nat @ X1 @ X3))), file('/export/starexec/sandbox/tmp/tmp.uNGUSLFT07/Vampire---4.8_31314', fact_98_add__strict__left__mono)).
0.47/0.68	thf(fact_2__092_060open_062min__dist_Au_At_A_092_060le_062_Alength_Ap2_H_092_060close_062, axiom, (ord_less_eq_nat @ (min_dist_capacity @ c @ ua @ t) @ (size_s1990949619at_nat @ p2_a)), file('/export/starexec/sandbox/tmp/tmp.uNGUSLFT07/Vampire---4.8_31314', fact_2__092_060open_062min__dist_Au_At_A_092_060le_062_Alength_Ap2_H_092_060close_062)).
0.47/0.68	thf(c_0_8, plain, ![X708:nat, X709:nat]:(((plus_plus_nat @ X708 @ X709)=(plus_plus_nat @ X709 @ X708))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_75_add_Ocommute])])).
0.47/0.68	thf(c_0_9, plain, ![X25:nat, X26:nat, X20:nat, X27:nat]:((((ord_less_nat @ X20 @ X27)&(ord_less_nat @ X25 @ X26))=>(ord_less_nat @ (plus_plus_nat @ X25 @ X20) @ (plus_plus_nat @ X26 @ X27)))), inference(fof_simplification,[status(thm)],[fact_102_add__mono__thms__linordered__field_I5_J])).
0.47/0.68	thf(c_0_10, plain, ![X982:nat, X983:nat]:(((plus_plus_nat @ X982 @ X983)=(plus_plus_nat @ X983 @ X982))), inference(variable_rename,[status(thm)],[c_0_8])).
0.47/0.68	thf(c_0_11, negated_conjecture, ~(ord_less_nat @ (min_dist_capacity @ c @ s @ t) @ (plus_plus_nat @ (size_s1990949619at_nat @ p1a) @ (size_s1990949619at_nat @ p2_a))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
0.47/0.68	thf(c_0_12, plain, ![X1052:nat, X1053:nat, X1054:nat, X1055:nat]:((~(ord_less_nat @ X1054 @ X1055)|~(ord_less_nat @ X1052 @ X1053)|(ord_less_nat @ (plus_plus_nat @ X1052 @ X1054) @ (plus_plus_nat @ X1053 @ X1055)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])).
0.47/0.68	thf(c_0_13, plain, ((min_dist_capacity @ c @ s @ t)=(plus_plus_nat @ (min_dist_capacity @ c @ s @ ua) @ (min_dist_capacity @ c @ ua @ t))), inference(split_conjunct,[status(thm)],[fact_0__092_060open_062min__dist_As_At_A_061_Amin__dist_As_Au_A_L_Amin__dist_Au_At_092_060close_062])).
0.47/0.68	thf(c_0_14, plain, ![X3:nat, X1:nat]:(((plus_plus_nat @ X1 @ X3)=(plus_plus_nat @ X3 @ X1))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.47/0.68	thf(c_0_15, negated_conjecture, ~((ord_less_nat @ (min_dist_capacity @ c @ s @ t) @ (plus_plus_nat @ (size_s1990949619at_nat @ p1a) @ (size_s1990949619at_nat @ p2_a)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.47/0.68	thf(c_0_16, plain, ![X3:nat, X1:nat, X4:nat, X5:nat]:(((ord_less_nat @ (plus_plus_nat @ X4 @ X1) @ (plus_plus_nat @ X5 @ X3))|~((ord_less_nat @ X1 @ X3))|~((ord_less_nat @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.47/0.68	thf(c_0_17, plain, ((plus_plus_nat @ (min_dist_capacity @ c @ ua @ t) @ (min_dist_capacity @ c @ s @ ua))=(min_dist_capacity @ c @ s @ t)), inference(rw,[status(thm)],[c_0_13, c_0_14])).
0.47/0.68	thf(c_0_18, plain, ![X699:nat, X700:nat]:(((ord_less_nat @ X699 @ X700)<=>(((X700)!=(X699))&(ord_less_eq_nat @ X699 @ X700)))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_270_dual__order_Ostrict__iff__order])])).
0.47/0.68	thf(c_0_19, negated_conjecture, ~((ord_less_nat @ (min_dist_capacity @ c @ s @ t) @ (plus_plus_nat @ (size_s1990949619at_nat @ p2_a) @ (size_s1990949619at_nat @ p1a)))), inference(rw,[status(thm)],[c_0_15, c_0_14])).
0.47/0.68	thf(c_0_20, plain, ![X1:nat, X3:nat]:(((ord_less_nat @ (min_dist_capacity @ c @ s @ t) @ (plus_plus_nat @ X1 @ X3))|~((ord_less_nat @ (min_dist_capacity @ c @ ua @ t) @ X1))|~((ord_less_nat @ (min_dist_capacity @ c @ s @ ua) @ X3)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
0.47/0.68	thf(c_0_21, plain, (ord_less_nat @ (min_dist_capacity @ c @ s @ ua) @ (size_s1990949619at_nat @ p1a)), inference(split_conjunct,[status(thm)],[fact_1__092_060open_062min__dist_As_Au_A_060_Alength_Ap1_092_060close_062])).
0.47/0.68	thf(c_0_22, plain, ![X810:nat, X811:nat]:((((((X811)!=(X810))|~(ord_less_nat @ X810 @ X811))&((ord_less_eq_nat @ X810 @ X811)|~(ord_less_nat @ X810 @ X811)))&(((X811)=(X810))|~(ord_less_eq_nat @ X810 @ X811)|(ord_less_nat @ X810 @ X811)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])).
0.47/0.68	thf(c_0_23, plain, ![X1:nat, X3:nat, X4:nat]:(((ord_less_nat @ X1 @ X3)=>(ord_less_nat @ (plus_plus_nat @ X4 @ X1) @ (plus_plus_nat @ X4 @ X3)))), inference(fof_simplification,[status(thm)],[fact_98_add__strict__left__mono])).
0.47/0.68	thf(c_0_24, negated_conjecture, ~((ord_less_nat @ (min_dist_capacity @ c @ ua @ t) @ (size_s1990949619at_nat @ p2_a))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])])).
0.47/0.68	thf(c_0_25, plain, ![X3:nat, X1:nat]:((((X1)=(X3))|(ord_less_nat @ X3 @ X1)|~((ord_less_eq_nat @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_22])).
0.47/0.68	thf(c_0_26, plain, (ord_less_eq_nat @ (min_dist_capacity @ c @ ua @ t) @ (size_s1990949619at_nat @ p2_a)), inference(split_conjunct,[status(thm)],[fact_2__092_060open_062min__dist_Au_At_A_092_060le_062_Alength_Ap2_H_092_060close_062])).
0.47/0.68	thf(c_0_27, plain, ![X991:nat, X992:nat, X993:nat]:((~(ord_less_nat @ X991 @ X992)|(ord_less_nat @ (plus_plus_nat @ X993 @ X991) @ (plus_plus_nat @ X993 @ X992)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])).
0.47/0.68	thf(c_0_28, negated_conjecture, ((min_dist_capacity @ c @ ua @ t)=(size_s1990949619at_nat @ p2_a)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])])).
0.47/0.68	thf(c_0_29, plain, ![X4:nat, X1:nat, X3:nat]:(((ord_less_nat @ (plus_plus_nat @ X4 @ X1) @ (plus_plus_nat @ X4 @ X3))|~((ord_less_nat @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_27])).
0.47/0.68	thf(c_0_30, plain, ((plus_plus_nat @ (size_s1990949619at_nat @ p2_a) @ (min_dist_capacity @ c @ s @ ua))=(min_dist_capacity @ c @ s @ t)), inference(rw,[status(thm)],[c_0_17, c_0_28])).
0.47/0.68	thf(c_0_31, plain, ![X1:nat]:(((ord_less_nat @ (min_dist_capacity @ c @ s @ t) @ (plus_plus_nat @ (size_s1990949619at_nat @ p2_a) @ X1))|~((ord_less_nat @ (min_dist_capacity @ c @ s @ ua) @ X1)))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
0.47/0.68	thf(c_0_32, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_31]), c_0_21])]), ['proof']).
0.47/0.68	# SZS output end CNFRefutation
0.47/0.68	# Parsed axioms                        : 315
0.47/0.68	# Removed by relevancy pruning/SinE    : 107
0.47/0.68	# Initial clauses                      : 364
0.47/0.68	# Removed in clause preprocessing      : 17
0.47/0.68	# Initial clauses in saturation        : 347
0.47/0.68	# Processed clauses                    : 927
0.47/0.68	# ...of these trivial                  : 29
0.47/0.68	# ...subsumed                          : 364
0.47/0.68	# ...remaining for further processing  : 534
0.47/0.68	# Other redundant clauses eliminated   : 81
0.47/0.68	# Clauses deleted for lack of memory   : 0
0.47/0.68	# Backward-subsumed                    : 12
0.47/0.68	# Backward-rewritten                   : 32
0.47/0.68	# Generated clauses                    : 4499
0.47/0.68	# ...of the previous two non-redundant : 4243
0.47/0.68	# ...aggressively subsumed             : 0
0.47/0.68	# Contextual simplify-reflections      : 4
0.47/0.68	# Paramodulations                      : 4405
0.47/0.68	# Factorizations                       : 6
0.47/0.68	# NegExts                              : 0
0.47/0.68	# Equation resolutions                 : 86
0.47/0.68	# Total rewrite steps                  : 625
0.47/0.68	# Propositional unsat checks           : 0
0.47/0.68	#    Propositional check models        : 0
0.47/0.68	#    Propositional check unsatisfiable : 0
0.47/0.68	#    Propositional clauses             : 0
0.47/0.68	#    Propositional clauses after purity: 0
0.47/0.68	#    Propositional unsat core size     : 0
0.47/0.68	#    Propositional preprocessing time  : 0.000
0.47/0.68	#    Propositional encoding time       : 0.000
0.47/0.68	#    Propositional solver time         : 0.000
0.47/0.68	#    Success case prop preproc time    : 0.000
0.47/0.68	#    Success case prop encoding time   : 0.000
0.47/0.68	#    Success case prop solver time     : 0.000
0.47/0.68	# Current number of processed clauses  : 281
0.47/0.68	#    Positive orientable unit clauses  : 46
0.47/0.68	#    Positive unorientable unit clauses: 2
0.47/0.68	#    Negative unit clauses             : 27
0.47/0.68	#    Non-unit-clauses                  : 206
0.47/0.68	# Current number of unprocessed clauses: 3807
0.47/0.68	# ...number of literals in the above   : 10169
0.47/0.68	# Current number of archived formulas  : 0
0.47/0.68	# Current number of archived clauses   : 200
0.47/0.68	# Clause-clause subsumption calls (NU) : 7831
0.47/0.68	# Rec. Clause-clause subsumption calls : 6472
0.47/0.68	# Non-unit clause-clause subsumptions  : 265
0.47/0.68	# Unit Clause-clause subsumption calls : 836
0.47/0.68	# Rewrite failures with RHS unbound    : 0
0.47/0.68	# BW rewrite match attempts            : 77
0.47/0.68	# BW rewrite match successes           : 43
0.47/0.68	# Condensation attempts                : 927
0.47/0.68	# Condensation successes               : 16
0.47/0.68	# Termbank termtop insertions          : 95899
0.47/0.68	
0.47/0.68	# -------------------------------------------------
0.47/0.68	# User time                : 0.127 s
0.47/0.68	# System time              : 0.011 s
0.47/0.68	# Total time               : 0.138 s
0.47/0.68	# Maximum resident set size: 3768 pages
0.47/0.68	
0.47/0.68	# -------------------------------------------------
0.47/0.68	# User time                : 0.552 s
0.47/0.68	# System time              : 0.041 s
0.47/0.68	# Total time               : 0.593 s
0.47/0.68	# Maximum resident set size: 2160 pages
0.47/0.68	% E---3.1 exiting
0.47/0.69	EOF